- epsilon algorithm
- Макаров: эпсилон-алгоритм
Универсальный англо-русский словарь. Академик.ру. 2011.
epsilon algorithm
Смотреть что такое "epsilon algorithm" в других словарях:
Ramer-Douglas-Peucker algorithm — The Douglas Peucker algorithm is an algorithm for smoothing curves. The initial form of the algorithm was established in 1973 by David Douglas and Thomas Peucker. Idea The purpose of the algorithm is that given a curve cmposed of line segments to … Wikipedia
Ramer–Douglas–Peucker algorithm — The Douglas–Peucker algorithm is an algorithm for reducing the number of points in a curve that is approximated by a series of points. The initial form of the algorithm was independently suggested in 1972 by Urs Ramer and 1973 by David Douglas… … Wikipedia
Cayley-Purser algorithm — The Cayley Purser algorithm was a public key cryptography algorithm published in early 1999 by 16 year old Irishwoman Sarah Flannery, based on an unpublished work by Michael Purser, founder of Baltimore Technologies, a Dublin data security… … Wikipedia
Pollard's p - 1 algorithm — Pollard s p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest … Wikipedia
Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there … Wikipedia
Frank–Wolfe algorithm — The Frank–Wolfe algorithm, also known as the convex combination algorithm , is a classic algorithm in operations research (OR). It was originally proposed by Marguerite Frank and Phil Wolfe in 1956 as a procedure for solving quadratic programming … Wikipedia
Machine epsilon — In floating point arithmetic, the machine epsilon (also called macheps, machine precision or unit roundoff) is, for a particular floating point unit, the difference between 1 and the smallest exactly representable number greater than one. It… … Wikipedia
Deutsch–Jozsa algorithm — The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992[1] with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.[2] Although it is of little practical use … Wikipedia
Deutsch-Jozsa algorithm — The Deutsch Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992 with improvements by R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca in 1998.cite journal author = David Deutsch and Richard Jozsa title =… … Wikipedia
Wang and Landau algorithm — The Wang and Landau algorithm is an extension of Metropolis Monte Carlo sampling.Initially designed for physical systems, the Metropolis Monte Carlo method was based on Boltzmann s insight that at a given temperature molecules are distributed… … Wikipedia
Adaptive quadrature — In applied mathematics, adaptive quadrature is a process in which the integral of a function f(x) is approximated using static quadrature rules on adaptively refined subintervals of the integration domain. Generally, adaptive algorithms are just… … Wikipedia
